home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.c++
- Path: oasis.enmu.edu!peanut!reinholj
- From: reinholj@math.enmu.edu (John Reinhold)
- Subject: Finding Permutations....????
- Sender: news@oasis.enmu.edu (All The News Fit To Print)
- Message-ID: <1996Jan16.160018.24583@oasis.enmu.edu>
- Date: Tue, 16 Jan 1996 16:00:18 GMT
- Organization: Eastern New Mexico University
- X-Newsreader: TIN [version 1.2 PL2]
-
- I am trying to find a good way to find permutations.
-
- I am looking for an algorythm that would help me
- get started, or lead me in the right direction.
-
- Say I have a set of numbers
- and Ineed to find every possible combination:
-
- example:
- 123
- 132
- 213
- 231
- 312
- 321
-
-
- the set of numbers needs to be any size
- (i used 3 numbers as a simple example.)
-
- I would not like a solution, just a lead in the right direction)
-
- I am using Borland C++ 4.5 if that means anything...
- thanks.
-
- -john
-
-
- --
- ----------------------------<*>----------------------------
- TEAM OS/2
- At WARP speed, Windows should not be open.
-
- OAKLAND RAIDERS REAL MEN WEAR BLACK
- ++++++++++++++++++++++++++++<:>++++++++++++++++++++++++++++
- reinholj@mnw.net Montgomery, Alabama USA
- reinholj@math.enmu.edu Portales, New Mexico USA
- No Constitution, No Freedom. SUPPORT THE BILL OF RIGHTS.
- (NOT the Bill of Gates!)
-